Short interval results for squarefree numbers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting squarefree numbers

We present an algorithm, based on the explicit formula for L-functions and conditional on GRH, for proving that a given integer is squarefree with little or no knowledge of its factorization. We analyze the algorithm both theoretically and practically, and use it to prove that several RSA challenge numbers are not squarefull.

متن کامل

Squarefree Smooth Numbers and Euclidean Prime Generators

We show that for each prime p > 7, every residue mod p can be represented by a squarefree number with largest prime factor at most p. We give two applications to recursive prime generators akin to the one Euclid used to prove the infinitude of primes.

متن کامل

p-Catalan Numbers and Squarefree Binomial Coefficients

In this paper we consider the generalized Catalan numbers F (s, n) = 1 (s−1)n+1 ( sn n ) , which we call s-Catalan numbers. For p prime, we find all positive integers n such that p divides F (p, n), and also determine all distinct residues of F (p, n) (mod p), q ≥ 1. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers by 4. In the second...

متن کامل

On Gaps between Squarefree Numbers Ii

In this paper, the authors continue their work on the problem of nding an h = h(x) as small as possible such that for x su ciently large, there is a squarefree number in the interval (x; x + h]: This problem has been investigated by Fogels [4], Roth [11], Richert [10], Rankin [9], Schmidt [12], Graham and Kolesnik [5], the second author [14,15], and the rst author [2]. In particular, the author...

متن کامل

-Catalan Numbers and Squarefree Binomial Coefficients

In this paper we consider the generalized Catalan numbers F (s, n) = 1 (s−1)n+1 ( sn n ) , which we call s-Catalan numbers. We find all natural numbers n such that for p prime, p divides F (p, n), q ≥ 1 and all distinct residues of F (p, n) (mod p), q = 1, 2. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers by 4. We also prove that ( ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Number Theory

سال: 1990

ISSN: 0022-314X

DOI: 10.1016/0022-314x(90)90108-4